Optimal Any-Angle Pathfinding In Practice
نویسندگان
چکیده
منابع مشابه
Optimal Any-Angle Pathfinding In Practice
Any-angle pathfinding is a fundamental problem in robotics and computer games. The goal is to find a shortest path between a pair of points on a grid map such that the path is not artificially constrained to the points of the grid. Prior research has focused on approximate online solutions. A number of exact methods exist but they all require supra-linear space and pre-processing time. In this ...
متن کاملAn Optimal Any-Angle Pathfinding Algorithm
Any-angle pathfinding is a common problem from robotics and computer games: it requires finding a Euclidean shortest path between a pair of points in a grid map. Prior research has focused on approximate online solutions. A number of exact methods exist but they all require supra-linear space and preprocessing time. In this paper we describe Anya: a new optimal any-angle pathfinding algorithm w...
متن کاملFast and Almost Optimal Any-Angle Pathfinding Using the 2k Neighborhoods
Any-angle path finding on grids is an important problem with applications in autonomous robot navigation. In this paper, we show that a well-known pre-processing technique, namely subgoal graphs, originally proposed for (non anyangle) 8-connected grids, can be straightforwardly adapted to the 2 neighborhoods, a family of neighborhoods that allow an increasing number of movements (and angles) as...
متن کاملEdge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of preprocessing. However, Visibility Graphs are known to perform poorly in terms of running time, es...
متن کاملAny-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm
Problem of finding conflict-free trajectories for multiple agents of identical circular shape, operating in shared 2D workspace, is addressed in the paper and decoupled, e.g. prioritized, approach is used to solve this problem. Agents’ workspace is tessellated into the square grid on which anyangle moves are allowed, e.g. each agent can move into arbitrary direction as long as this move follows...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2016
ISSN: 1076-9757
DOI: 10.1613/jair.5007